A Convergence Theorem for Λ-Trees

Convergence theorem for an iterative algorithm of λ-strict pseudocontraction

In this article, we prove strong convergence of sequence generated by the following iteration sequence for a class of Lipschitzian pseudocontractive mapping T: x n+1 = β n u + (1 − β n)[α n Tx n + (1 − α n)x n ] whenever {a n } and {b n } satisfy the appropriate conditions.

A Convergence Theorem For Controlled . . .

Strong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

A computational model and convergence theorem for rumor dissemination in social networks

The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...

Convergence Rates in the Implicit Renewal Theorem on Trees

R D = f(Ci, Ri, 1 ≤ i ≤ N), where f(·) is a possibly random real valued function, N ∈ {0, 1, 2, 3, . . . } ∪ {∞}, {Ci}i∈N are real valued random weights and {Ri}i∈N are iid copies of R, independent of (N,C1, C2, . . . ); D = represents equality in distribution. In the recent paper [10], an Implicit Renewal Theorem was developed that enables the characterization of the power tail asymptotics of ...